Relative Definability and Models of Unary PCF
نویسندگان
چکیده
منابع مشابه
Sequentiality in Bounded Biorders
We study a notion of bounded stable biorder, showing that the monotone and stable functions on such biorders are sequential. We construct bounded biorder models of a range of sequential, higher-order functional calculi, including unary PCF, (typed and untyped) call-by-value and lazy λ-calculi, and non-deterministic SPCF. We prove universality and full abstraction results for these models by red...
متن کاملInvestigations on Relative Definability in Pcf
The focus of this thesis is the study of relative definability of first-order boolean functions with respect to the language PCF, a paradigmatic typed, higher-order language based on the simply-typed λ-calculus. The basic core language is sequential. We study the effect of adding construct that embody various notions of parallel execution. The resulting set of equivalence classes with respect t...
متن کاملAxioms for definability and full completeness
Axioms are presented on models of PCF from which full abstraction can be proved. These axioms have been distilled from recent results on definability and full abstraction of game semantics for a number of programming languages. Full completeness for pure simply-typed λ-calculus is also axiomatized.
متن کاملUnary PCF is Decidable
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], has a decidable observational pre-order, and that its fully abstract model is effectively presentable. This is in marked contrast to larger fragments, where corresponding results fail [?]. The techniques used are adaptions of those of Padovani [?], who applied them to the minimal model of the simply typed lambda calculus.
متن کاملHypergraphs and Degrees of Parallelism: A Completeness Result
In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [2, 4]). We introduce the notion of timed hypergraph morphism and show that it is: – Sound: if there exists a timed morphism from Hf to Hg then f is PCF-definable relatively to g. – Complete for subsequential functions: if f is PCF-definable relatively to g, and g ...
متن کامل